package com.origin.niuke.tree;

import general_class.TreeNode;

/**
 * @author yzh
 * @date 2022/7/25 21:43
 * 合并二叉树
 * 算法：递归
 */
public class BM32 {

    public TreeNode mergeTrees(TreeNode t1, TreeNode t2) {
        if (t1 == null) return t2;
        if (t2 == null) return t1;
        TreeNode node = new TreeNode(t1.val + t2.val);
        node.left = mergeTrees(t1.left, t2.left);
        node.right = mergeTrees(t1.right, t2.right);
        return node;
    }

}
